Beyond Nash Equilibrium in Open Spectrum Sharing: Lorenz Equilibrium in Discrete Games
نویسندگان
چکیده
A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is presented – the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems. Nash equilibrium (NE) rarely ensures maximal payoff and it is frequently Pareto inefficient. The Pareto set is usually a large set of solutions, often too hard to process. The Lorenz equilibrium is a subset of Pareto efficient solutions that are equitable for all players and ensures a higher payoff than the Nash equilibrium. LE induces a selection criterion of NE, when several are present in a game (e.g. many-player discrete games) and when fairness is an issue. Besides being an effective NE selection criterion, the LE is an interesting game theoretical situation per se, useful for CR interaction analysis.
منابع مشابه
A Relevant Equilibrium in Open Spectrum Sharing: Lorenz Equilibrium in Discrete Games
A new game theoretical solution concept for open spectrum sharing in cognitive radio (CR) environments is highlighted – the Lorenz equilibrium (LE). Both Nash and Pareto solution concepts have limitations when applied to real world problems. Nash equilibrium (NE) rarely ensures maximal payoff and it is frequently Pareto inefficient. The Pareto set is usually a large set of solutions, often too ...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کاملThe Complexity of Equilibria in Cost Sharing Games
We study Congestion Games with non-increasing cost functions (Cost Sharing Games) from a complexity perspective and resolve their computational hardness, which has been an open question. Specifically we prove that when the cost functions have the form f(x) = cr/x (Fair Cost Allocation) then it is PLS-complete to compute a Pure Nash Equilibrium even in the case where strategies of the players ar...
متن کاملDisturbed Discrete Time Linear-Quadratic Open-Loop Nash games
We examine disturbed linear-quadratic games, where each player chooses his strategy according to a modified Nash equilibrium model under open-loop information structure. We give conditions for the existence and uniqueness of such an equilibrium. We also show how these conditions are related to certain Riccati difference equations and a boundary value problem.
متن کاملAn equilibrium closure result for discontinuous games
For games with discontinuous payoffs Simon and Zame (Econometrica 58:861–872, 1990) introduced payoff indeterminacy, in the form of endogenous sharing rules, which are measurable selections of a certain payoff correspondence. Their main result concerns the existence of a mixed Nash equilibrium and an associated sharing rule. Its proof is based on a discrete approximation scheme “from within” th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1304.1658 شماره
صفحات -
تاریخ انتشار 2013